d,h=map(int,input().split())
a=[[*map(int,input().split())]for _ in[1]*(d)]
p=q=0
for i in a:p+=i[0];q+=i[1]
if p<=h<=q:
d=h-p
o=[]
for f, s in a:
if d>0:m=min(d,s-f);d-=m;f+=m
o+=[f]
print("YES")
print(*o)
else:print("NO")#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
//freopen("input.txt" , "r" , stdin);
//freopen("output.txt" , "w" , stdout);
int d;
cin>>d;
int su;
cin>>su;
int a[d][2];
int ans[d]={0};
for(int i=0;i<d;i++){
cin>>a[i][0]>>a[i][1];
ans[i]=a[i][0];
su-=a[i][0];
}
if(su<0){
cout<<"NO";
}
int ctr=0;
while((su>0)&&(ctr!=d)){
ctr=0;
for(int i=0;(i<d)&&(su>0);i++){
if(ans[i]<a[i][1]){
ans[i]++;
su--;
}
else{
ctr++;
}
}
}
if(su>0){
cout<<"NO";
}
else if(su==0){
cout<<"YES"<<"\n";
for(int i=0;i<d;i++){
cout<<ans[i]<<" ";
}
}
return 0;
}74. Search a 2D Matrix | 71. Simplify Path |
62. Unique Paths | 50. Pow(x, n) |
43. Multiply Strings | 34. Find First and Last Position of Element in Sorted Array |
33. Search in Rotated Sorted Array | 17. Letter Combinations of a Phone Number |
5. Longest Palindromic Substring | 3. Longest Substring Without Repeating Characters |
1312. Minimum Insertion Steps to Make a String Palindrome | 1092. Shortest Common Supersequence |
1044. Longest Duplicate Substring | 1032. Stream of Characters |
987. Vertical Order Traversal of a Binary Tree | 952. Largest Component Size by Common Factor |
212. Word Search II | 174. Dungeon Game |
127. Word Ladder | 123. Best Time to Buy and Sell Stock III |
85. Maximal Rectangle | 84. Largest Rectangle in Histogram |
60. Permutation Sequence | 42. Trapping Rain Water |
32. Longest Valid Parentheses | Cutting a material |
Bubble Sort | Number of triangles |
AND path in a binary tree | Factorial equations |